An Improved Bound on the Cardinality of the Minimal Pairwise Balanced Designs on 18 Points with Maximum Block Size 4
نویسندگان
چکیده
The cardinality of the minimal pairwise balanced designs on v elements with largest block size k is denoted by g(k)(v). It is known that 31 ≤ g(4)(18) ≤ 33. In this paper we show that g(4)(18) 6= 31.
منابع مشابه
The minimum number of blocks in pairwise balanced designs with maximum block size 4: the final cases
The minimum number of blocks having maximum size precisely four that are required to cover, exactly λ times, all pairs of elements from a set of cardinality v is denoted by g λ (v) (or g (4)(v) when λ = 1). All values of g (4) λ (v) are known except for λ = 1 and v = 17 or 18. It is known that 30 ≤ g(4)(17) ≤ 31 and 32 ≤ g(4)(18) ≤ 33. In this paper we show that g(4)(17) 6= 30 and g(4)(18) 6= 3...
متن کاملExtremal Problems 2or Pairwise Balanced Designs
1 . Introduction In a previous paper [2] the senior author discussed many problems concerning block designs . Some of these have since been settled . Szemerédi and Trotter [5] showed, for example, that the number of pairwise balanced designs which can be obtained geometrically on n points in the plane with the blocks being the lines joining these points is at most exp(c/) . In [1] Colbourn, Phe...
متن کاملOn The Spectrum of Minimal Defining Sets of Full Designs
A defining set of a t-(v,k,λ ) design is a subcollection of the block set of the design which is not contained in any other design with the same parameters. A defining set is said to be minimal if none of its proper subcollections is a defining set. A defining set is said to be smallest if no other defining set has a smaller cardinality. A t-(v,k,λ ) design D = (V,B) is called a full design if ...
متن کاملOn cardinality of network subspace codes
We analyze properties of different subspace network codes. Our study includes Silva-Koetter-Kshishang codes (SKK-codes), multicomponent codes with zero prefix (Gabidulin-Bossert codes), codes based on combinatorial block designs, Etzion-Silberstein codes (E-S codes) based on Ferrer’s diagrams, and codes which use greedy search algorithm and restricted rank codes. We calculate cardinality values...
متن کاملResolvable balanced incomplete block designs with subdesigns of block size 4
In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v, 4, 1) RBIBDs. The problem we investigate is the existence of (v, 4, 1) RBIBDs containing a (w, 4, 1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005